The Carathéodory-Fejér-Pisarenko Decomposition and Its Multivariable Counterpart
نویسنده
چکیده
When a covariance matrix with a Toeplitz structure is written as the sum of a singular one and a positive scalar multiple of the identity, the singular summand corresponds to the covariance of a purely deterministic component of a time-series whereas the identity corresponds to white noise—this is the Carathéodory-Fejér-Pisarenko (CFP) decomposition. In the present paper we study multivariable analogs for block-Toeplitz matrices as well as for matrices with the structure of state-covariances of finite-dimensional linear systems (which include block-Toeplitz ones). We characterize state-covariances which admit only a deterministic input power spectrum. We show that multivariable decomposition of a state-covariance in accordance with a “deterministic component + white noise” hypothesis for the input does not exist in general, and develop formulae for spectra corresponding to singular covariances via decomposing the contribution of the singular part. We consider replacing the “scalar multiple of the identity” in the CFP decomposition by a covariance of maximal trace which is admissible as a summand. The summand can be either (block-)diagonal corresponding to white noise or have a “short-range correlation structure” correponding to a moving average component. The trace represents the maximal variance/energy that can be accounted for by a process (e.g., noise) with the aforementioned structure at the input, and the optimal solution can be computed via convex optimization. The decomposition of covariances and spectra according to the range of their time-domain correlations is an alternative to the CFP-dictum with potentially great practical significance. Index Terms Multivariable time-series, spectral analysis, spectral estimation, central solution, Pisarenko harmonic decomposition, short-range correlation structure, moving average noise, convex optimization.
منابع مشابه
Carathéodory-Fejér type extremal problems on locally compact Abelian groups
We consider the extremal problem of maximizing a point value | f (z) | at a given point z ∈ G by some positive definite and continuous function f on a locally compact Abelian group (LCA group) G, where for a given symmetric open set Ω ∋ z, f vanishes outside Ω and is normalized by f (0) = 1. This extremal problem was investigated in R and Rd and for Ω a 0-symmetric convex body in a paper of Boa...
متن کاملA comparative study of three recursive least-squares algorithms for single-tone frequency tracking
Abstract Modi ed covariance Pisarenko harmonic decomposition and reformed Pisarenko harmonic decomposition methods are three closed form frequency estimators which are derived from the linear prediction property of sinusoidal signals In this paper we develop the recursive least squares type realizations of these estimators for a single real tone and their frequency tracking performances are con...
متن کاملStructural Decomposition and its Properties of Linear Multivariable Singular Systems
We present in this paper a structural decomposition for linear multivariable singular systems. Such a decomposition has a distinct feature of capturing and displaying all the structural properties, such as the finite and infinite zero structures, invertibility structures, and redundant dynamics of the given system. As its counterpart for non-singular systems, we believe that the technique is a ...
متن کاملStudy of the statistical performance of the Pisarenko harmonic decomposition method - Radar and Signal Processing [see also IEE Proceedings-Radar, Sonar and Navigation], IEE Proceeding
A self-contained statistical analysis of the Pisarenko method for estimating sinusoidal frequencies from signal measurements corrupted by white noise is presented. An explicit formula is provided for the asymptotic covariance matrix of the joint estimation errors of the minimum eigenvalue and the minimum eigenfilter coefficients of the data covariance matrix. Our theoretical results extend and ...
متن کاملExtension of the Pisarenko method to sparse linear arrays
When applied to array processing, the Pisarenko harmonic decomposition (PHD) method is limited to linear equispaced arrays. We present an approach that allows us to extend it to general arrays, although for the ease of exposition, we consider only sparse linear arrays. We exploit the fact that the PHD can be seen as a deconvolution or model-fitting approach that minimizes an `1 norm and can thu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Automat. Contr.
دوره 52 شماره
صفحات -
تاریخ انتشار 2007